feat(executor): Add a parallel dataflow scheduler #20
+874
−41
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
david-zk
approved these changes
Sep 12, 2024
|
I will look at the PR in detail tomorrow. One thing I was wondering about - |
Daggy is an extension of petgraph specialised for DAGs. I think it's likely to be just fine and we can always switch over if needed. |
dartdart26
reviewed
Sep 13, 2024
dartdart26
approved these changes
Sep 13, 2024
… a SyncComputeRequest The scheduler runs on top of a DFG built using the daggy extension to petgraph and executes computations/tasks along the wavefront of maximum parallelism within the graph. Circular dependences are detected early.
antoniupop
force-pushed
the
antoniu/dataflow-graph-scheduling
branch
from
9cb4ef4 to
5080aeb
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Add a parallel dataflow scheduler for computations in a SyncComputeRequest.
The scheduler runs on top of a DFG built using the daggy extension to petgraph and executes computations/tasks along the wavefront of maximum parallelism within the graph.
Circular dependences are detected early.